The dimension of subcode-subfields of shortened generalized Reed-Solomon codes
نویسندگان
چکیده
Reed-Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length. In many applications where the length is static, the appropriate length can be obtained by an RS code by shortening or puncturing. Generalized Reed-Solomon (GRS) codes are a generalization of RS codes, whose subfield-subcodes are extensively studied. In this paper we show that a particular class of GRS codes produces many subfield-subcodes with large dimension. An algorithm for searching through the codes is presented as well as a list of new codes obtained from this method.
منابع مشابه
Subspace Subcodes of Reed-Solomon Codes
space subcode of a Reed-Solomon (SSRS) code Over GF(2"') is the set of RS codewords, whose components all lie in a particular GF(2)subspace of GF(2"). SSRS codes include both generalized B C H codes and "trace-shortened" Rs codes [2][3] as special casea. In this paper we present an explicit formula for t h e dimension of an arbitrary RS subspace subcode. Using this formula, we And that in many ...
متن کاملGeneralized subspace subcodes with application in cryptology
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode method, which leads to Alternant codes and Goppa codes over the underlying prime field, or over some intermediate subfield. The main advantages of these constr...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملAn Exponential Number of Generalized Kerdock Codes
If a subcode of the second order Reed-Mul ler code of length 2 ~ has minimum distance 2 ~ ~ 2 (1/2)~-~ then it has at most 2 2~ words. A generalized Kerdock code is defined to be such a subcode in which this max imum is attained. Such codes were first constructed by Kerdock [7]. His codes are extended cyclic codes, in the sense that there is an au tomorphism of order 2" 1 fixing one coordinate ...
متن کاملDecoding Shortened Reed Solomon Codes at Bit Level
This study presents a novel means of shortening a Reed Solomon (RS) code at the bit level, yielding only shortened BCH subcodes. With the use of a certain basis, an RS codes over ) 2 ( m GF is mapped onto a binary image[4], which contains m concatenated BCH sub-codewords and some glue-vector codewords. With the proposed approach, there only exist some shortened BCH subcode generators in the dia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 69 شماره
صفحات -
تاریخ انتشار 2013